翻訳と辞書 Words near each other ・ Random Access Music ・ Random act of kindness ・ Random Acts of Comedy ・ Random Acts of Genealogical Kindness ・ Random Acts of Heroic Love ・ Random Acts of Intimacy ・ Random Acts of Kindness Day ・ Random Acts of Senseless Violence ・ Random Acts of Violence (comics) ・ Random Album Title ・ Random algebra ・ Random and Scattered ・ Random assignment ・ Random Axe ・ Random ballot ・ Random binary tree ・ Random boosting ・ Random checkpoint ・ Random chimeragenesis on transient templates ・ Random close pack ・ Random coil ・ Random coil index ・ Random compact set ・ Random coordinate descent ・ Random digit dialing ・ Random Disc Records ・ Random dopant fluctuation ・ Random dot stereogram ・ Random dungeon ・ Random dynamical system Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Random binary tree ： ウィキペディア英語版 Random binary tree In computer science and probability theory, a random binary tree refers to a binary tree selected at random from some probability distribution on binary trees. Two different distributions are commonly used: binary trees formed by inserting nodes one at a time according to a random permutation, and binary trees chosen from a uniform discrete distribution in which all distinct trees are equally likely. It is also possible to form other distributions, for instance by repeated splitting. Adding and removing nodes directly in a random binary tree will in general disrupt its random structure, but the treap and related randomized binary search tree data structures use the principle of binary trees formed from a random permutation in order to maintain a balanced binary search tree dynamically as nodes are inserted and deleted. For random trees that are not necessarily binary, see random tree. ==Binary trees from random permutations== For any set of numbers (or, more generally, values from some total order), one may form a binary search tree in which each number is inserted in sequence as a leaf of the tree, without changing the structure of the previously inserted numbers. The position into which each number should be inserted is uniquely determined by a binary search in the tree formed by the previous numbers. For instance, if the three numbers (1,3,2) are inserted into a tree in that sequence, the number 1 will sit at the root of the tree, the number 3 will be placed as its right child, and the number 2 as the left child of the number 3. There are six different permutations of the numbers (1,2,3), but only five trees may be constructed from them. That is because the permutations (2,1,3) and (2,3,1) form the same tree. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Random binary tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.